Modular arithmetic - PDFSEARCH.IO - Document Search Engine

Modular arithmetic
Results: 480

#	Item
171	FINDING COMPOSITE ORDER ORDINARY ELLIPTIC CURVES USING THE COCKS-PINCH METHOD D. BONEH, K. RUBIN, AND A. SILVERBERG Abstract. We apply the Cocks-Pinch method to obtain pairing-friendly composite order groups with prescri Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-05-03 13:25:59 Elliptic curves Finite fields Modular arithmetic Integer factorization algorithms Elliptic curve Supersingular elliptic curve Prime number Quadratic reciprocity Primality test Abstract algebra Mathematics Number theory
172	The Density of Zeros of Forms for which Weak Approximation Fails D.R. Heath-Brown Magdalen College, Oxford Abstract The weak approximation principal fails for the forms x3 + y 3 + z 3 = Add to Reading List Source URL: eprints.maths.ox.ac.uk Language: English - Date: 2009-07-20 09:53:33 Algebraic number theory Modular arithmetic Quadratic reciprocity Quadratic residue Operator theory Meijer G-function Euclidean algorithm Mathematics Number theory Abstract algebra
173	COM~INATOFaCA8[removed]306 COMBINAIORICA Akad6miai K i a d 6 ~ Springer-Verlag Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2010-03-11 02:24:52 Diophantine approximation Commutative algebra Modular arithmetic Exponentiation Binomial coefficient Liouville number Mathematics Abstract algebra Combinatorics
174	Power Attack on Small RSA Public Exponent Pierre-alain Fouque1 , S´ebastien Kunz-Jacques1,2 , Gwena¨elle Martinet2 , Fr´ed´eric Muller3 , and Fr´ed´eric Valette4 ´ Ecole normale sup´erieure, 45 rue d’Ulm, 75005 Add to Reading List Source URL: www.iacr.org Language: English - Date: 2009-03-05 01:42:52 Electronic commerce Modular arithmetic Computer arithmetic RSA Hamming weight Modular exponentiation Exponentiation by squaring Exponentiation Blinding Mathematics Public-key cryptography Exponentials
175	The Correctness of the AKS Primality Test in Coq∗ Fl´avio L. C. de Moura1 , Ricardo Tadeu1 1 Departamento de Ciˆencia da Computac¸a˜ o – Universidade de Bras´ılia (UnB) Caixa Postal 4466 – CEP[removed] – B Add to Reading List Source URL: www.cic.unb.br Language: English - Date: 2008-08-12 14:42:17 Primality tests Finite fields Integer sequences Modular arithmetic AKS primality test Prime number XTR Coprime Primality certificate Mathematics Abstract algebra Number theory
176	PDF Document Add to Reading List Source URL: www.emis.ams.org Language: English - Date: 2012-06-12 13:07:33 Modular arithmetic Algebraic number theory Integer sequences Quadratic residue Mersenne prime Quadratic reciprocity Prime number Perfect number Quartic reciprocity Mathematics Number theory Abstract algebra
177	PDF Document Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2002-11-25 14:55:27 Modular arithmetic Carmichael number Pseudoprimes Prime number Primality test Coprime Mathematics Integer sequences Number theory
178	This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2011-07-10 02:35:13 Pseudoprimes Modular arithmetic Abstract algebra Miller–Rabin primality test Solovay–Strassen primality test Probable prime Fermat primality test Prime number Strong pseudoprime Mathematics Number theory Primality tests
179	A Computational Introduction to Number Theory and Algebra (Version 1) Victor Shoup This PDF document contains hyperlinks, and one may navigate through it Add to Reading List Source URL: www.shoup.net Language: English - Date: 2005-01-20 09:16:20 Finite fields Polynomials Modular arithmetic Computer algebra Group theory Prime number Euclidean algorithm Discrete logarithm Quadratic residue Mathematics Algebra Abstract algebra
180	Extended Euclid’s Algorithm The extended Euclid’s algorithm can be used to express gcd(a, b) as an integer linear combination of a and b, i.e., we can use it to find integers x and y such that ax + by = gcd(a, b). Le Add to Reading List Source URL: pages.pacificcoast.net Language: English - Date: 2006-11-11 11:30:09 Modular arithmetic Integer factorization algorithms Extended Euclidean algorithm Greatest common divisor Mathematics Number theory Euclidean algorithm

UPDATE